Quantum Bloom Filter and Its Applications

A quantum Bloom filter is a spatially more efficient data structure which used to represent set of $n$ elements by using notation="LaTeX">$O({{\rm{log}}nk})$ qubits. In this article, we define and design its corresponding algorithms. Due the reversibility operators, it can not only add new element but also delete an existing from filter. Furthermore, employ solve two private issues, i.e., oblivious set-member decision multiparty intersection cardinality. The results show that has inherent advantages in privacy-preserving applications concerning operations.